Optimal Parallel Construction of Minimal Suffix and Factor Automata
نویسندگان
چکیده
منابع مشابه
Parallel Construction of Minimal Suffix and Factor Automata
This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor aut...
متن کاملScalable Parallel Suffix Array Construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in bioinformatics. We describe the first implementation and experimental evaluation of a scalable parallel algorithm for suffix array construction. The implementation works on distributed memory computers using MPI, Experi...
متن کاملParallel Log-time Construction of Suffix Trees
Many string matching applications are based on suffix trees. Linear time sequential algorithms are available for constructing such trees. A CReW Parnllel RAM algorithm is presented here which takes 0 (logn) time with n processors, n being the length of the input string. The algorithm requires ern2) space, but only 0 (n iogn) cells need to be initialized.
متن کاملParallel Suffix Array Construction by Accelerated Sampling
A deterministic BSP algorithm for constructing the suffix array of a given string is presented, based on a technique that we call accelerated sampling. It runs in optimal O( p ) local computation and communication, and requires a near optimal O(log log p) supersteps. The algorithm provides an improvement over the synchronisation costs of existing algorithms, and reinforces the importance of the...
متن کاملOptimal Logarithmic Time Randomized Suffix Tree Construction
The suffix tree of a string, the fundamental data structure in the area of combinatorial pattern matching, has many elegant applications. In this paper, we present a novel, simple sequential algorithm for the construction of suffix trees. We are also able to parallelize our algorithm so that we settle the main open problem in the construction of suffix trees: we give a Las Vegas CRCW PRAM algor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BRICS Report Series
سال: 1995
ISSN: 1601-5355,0909-0878
DOI: 10.7146/brics.v2i16.19884